Extensions to type systems can preserve operational equivalences
Identifieur interne : 00CD28 ( Main/Exploration ); précédent : 00CD27; suivant : 00CD29Extensions to type systems can preserve operational equivalences
Auteurs : Jon G. Riecke [États-Unis] ; Ramesh Subrahmanyam [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We consider call-by-name, call-by-value, and lazy versions of PCF, and prove, using both syntactic and semantic means, that the operational equivalences of the base language are preserved when the language is extended with sum and product types, with polymorphic types, and with recursive types. These theorems show that the type systems of the extended languages are orthogonal to the type systems of the original languages.
Url:
DOI: 10.1007/3-540-57887-0_91
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000815
- to stream Istex, to step Curation: 000810
- to stream Istex, to step Checkpoint: 002D17
- to stream Main, to step Merge: 00D596
- to stream Main, to step Curation: 00CD28
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Extensions to type systems can preserve operational equivalences</title><author><name sortKey="Riecke, Jon G" sort="Riecke, Jon G" uniqKey="Riecke J" first="Jon G." last="Riecke">Jon G. Riecke</name></author><author><name sortKey="Subrahmanyam, Ramesh" sort="Subrahmanyam, Ramesh" uniqKey="Subrahmanyam R" first="Ramesh" last="Subrahmanyam">Ramesh Subrahmanyam</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:243B3E852A240109874B094D27A76AD27EDDE2A7</idno><date when="1994" year="1994">1994</date><idno type="doi">10.1007/3-540-57887-0_91</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-2428S7XZ-Z/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000815</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000815</idno><idno type="wicri:Area/Istex/Curation">000810</idno><idno type="wicri:Area/Istex/Checkpoint">002D17</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002D17</idno><idno type="wicri:doubleKey">0302-9743:1994:Riecke J:extensions:to:type</idno><idno type="wicri:Area/Main/Merge">00D596</idno><idno type="wicri:Area/Main/Curation">00CD28</idno><idno type="wicri:Area/Main/Exploration">00CD28</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Extensions to type systems can preserve operational equivalences</title><author><name sortKey="Riecke, Jon G" sort="Riecke, Jon G" uniqKey="Riecke J" first="Jon G." last="Riecke">Jon G. Riecke</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">New Jersey</region></placeName><wicri:cityArea>AT&T Bell Laboratories, 600 Mountain Avenue, 07974, Murray Hill</wicri:cityArea></affiliation><affiliation></affiliation></author><author><name sortKey="Subrahmanyam, Ramesh" sort="Subrahmanyam, Ramesh" uniqKey="Subrahmanyam R" first="Ramesh" last="Subrahmanyam">Ramesh Subrahmanyam</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">Connecticut</region></placeName><wicri:cityArea>Department of Mathematics, Wesleyan University, 06459, Middletown</wicri:cityArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We consider call-by-name, call-by-value, and lazy versions of PCF, and prove, using both syntactic and semantic means, that the operational equivalences of the base language are preserved when the language is extended with sum and product types, with polymorphic types, and with recursive types. These theorems show that the type systems of the extended languages are orthogonal to the type systems of the original languages.</div></front></TEI><affiliations><list><country><li>États-Unis</li></country><region><li>Connecticut</li><li>New Jersey</li></region></list><tree><country name="États-Unis"><region name="New Jersey"><name sortKey="Riecke, Jon G" sort="Riecke, Jon G" uniqKey="Riecke J" first="Jon G." last="Riecke">Jon G. Riecke</name></region><name sortKey="Subrahmanyam, Ramesh" sort="Subrahmanyam, Ramesh" uniqKey="Subrahmanyam R" first="Ramesh" last="Subrahmanyam">Ramesh Subrahmanyam</name><name sortKey="Subrahmanyam, Ramesh" sort="Subrahmanyam, Ramesh" uniqKey="Subrahmanyam R" first="Ramesh" last="Subrahmanyam">Ramesh Subrahmanyam</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00CD28 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00CD28 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:243B3E852A240109874B094D27A76AD27EDDE2A7
|texte= Extensions to type systems can preserve operational equivalences
}}
| This area was generated with Dilib version V0.6.33. |  |